An efficient data structure for counting all linear extensions of a poset, calculating its jump number, and the likes
نویسنده
چکیده
Achieving the goals in the title (and others) relies on a cardinality-wise scanning of the ideals of the poset. Specifically, the relevant numbers attached to the k + 1 elment ideals are inferred from the corresponding numbers of the k-element (order) ideals. Crucial in all of this is a compressed representation (using wildcards) of the ideal lattice. The whole scheme invites distributed computation.
منابع مشابه
The Calculation of the output price vectorby applying reverse linear programming: The novel approach in DEA
In the today’s world wherein every routine is based on economic factors, there is no doubt that theoretical sciences are driven by their capabilities and affordances in terms of economy. As a mathematical tool, data envelopment analysis (DEA) is provided to economics, so that one can investigate associated costs, prices and revenues of economic units. Data Envelopment Analysis (DEA) is a linear...
متن کاملRandom Linear Extensions of Grids
A grid poset – or grid for short – is a product of chains. We ask, what does a random linear extension of a grid look like? In particular, we show that the average “jump number,” i.e., the number of times that two consecutive elements in a linear extension are incomparable in the poset, is close to its maximum possible value. The techniques employed rely on entropy arguments. We finish with sev...
متن کاملNear-linear time simulation of linear extensions of a height-2 poset with bounded interaction
A linear extension of a poset ([n], ) is a permutation σ such that if σ(i) σ( j), then i ≤ j. The problem considered here is sampling uniformly from the set of linear extensions. The best known algorithm for the general problem requires time O(n3 lnn). This work presents the first new method that is provably faster for a nontrivial class of posets. Specifically, when the poset is height-2 (so t...
متن کاملCounting Linear Extensions: Parameterizations by Treewidth
We consider the #P-complete problem of counting the number of linear extensions of a poset (#LE); a fundamental problem in order theory with applications in a variety of distinct areas. In particular, we study the complexity of #LE parameterized by the well-known decompositional parameter treewidth for two natural graphical representations of the input poset, i.e., the cover and the incomparabi...
متن کاملThe Number of Linear Extensions of Ranked Posets
We revisit the question of counting the number of linear extensions of the Boolean lattice, relating this to the polyhedral methods of Kahn and Kim, and of Stanley. We give simpler proofs of various known results, and give an upper bound on the number of linear extensions of an arbitrary ranked poset satisfying the LYM condition. [Note: This preprint is not intended for journal publication, as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1704.07708 شماره
صفحات -
تاریخ انتشار 2017